85D - Sum of Medians - CodeForces Solution


binary search brute force data structures implementation *2300

Please click on ads to support us..

C++ Code:

#include <bits/stdc++.h>
#define pos lower_bound(v.begin(),v.end(),x)
using namespace std;
int n,x;
vector<int> v;
int main() {
cin>>n;
while(n--){
string s;
cin>>s;
if(s[0]=='s'){
long long r=0;
for(int i=2;i<v.size();i+=5)r+=v[i];
cout<<r<<endl;
}
else{
cin>>x;
if(s[0]=='a')v.insert(pos,x);
else v.erase(pos);
}
}
return 0;
}


Comments

Submit
0 Comments
More Questions

1296A - Array with Odd Sum
1385A - Three Pairwise Maximums
911A - Nearest Minimums
102B - Sum of Digits
707A - Brain's Photos
1331B - Limericks
305B - Continued Fractions
1165B - Polycarp Training
1646C - Factorials and Powers of Two
596A - Wilbur and Swimming Pool
1462B - Last Year's Substring
1608B - Build the Permutation
1505A - Is it rated - 2
169A - Chores
765A - Neverending competitions
1303A - Erasing Zeroes
1005B - Delete from the Left
94A - Restoring Password
1529B - Sifid and Strange Subsequences
1455C - Ping-pong
1644C - Increase Subarray Sums
1433A - Boring Apartments
1428B - Belted Rooms
519B - A and B and Compilation Errors
1152B - Neko Performs Cat Furrier Transform
1411A - In-game Chat
119A - Epic Game
703A - Mishka and Game
1504C - Balance the Bits
988A - Diverse Team